<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Medium
  </div>
  <div>
   <h1 class="question_title">
    274. H-Index
   </h1>
   <p>
    Given an array of citations (each citation is a non-negative integer) of a researcher, write a function to compute the researcher's h-index.
   </p>
   <p>
    According to the
    <a href="https://en.wikipedia.org/wiki/H-index" target="_blank">
     definition of h-index on Wikipedia
    </a>
    : "A scientist has index
    <i>
     h
    </i>
    if
    <i>
     h
    </i>
    of his/her
    <i>
     N
    </i>
    papers have
    <b>
     at least
    </b>
    <i>
     h
    </i>
    citations each, and the other
    <i>
     N &minus; h
    </i>
    papers have
    <b>
     no more than
    </b>
    <i>
     h
    </i>
    citations each."
   </p>
   <p>
    <b>
     Example:
    </b>
   </p>
   <pre>
<b>Input:</b> <code>citations = [3,0,6,1,5]</code>
<b>Output:</b> 3 
<strong>Explanation: </strong><code>[3,0,6,1,5] </code>means the researcher has <code>5</code> papers in total and each of them had 
             received <code>3, 0, 6, 1, 5</code> citations respectively. 
&nbsp;            Since the researcher has <code>3</code> papers with <b>at least</b> <code>3</code> citations each and the remaining 
&nbsp;            two with <b>no more than</b> <code>3</code> citations each, her h-index is <code>3</code>.</pre>
   <p>
    <strong>
     Note:&nbsp;
    </strong>
    If there are several possible values for
    <em>
     h
    </em>
    , the maximum one is taken as the h-index.
   </p>
  </div>
  <div>
   <h1 class="question_title">
    274. H指数
   </h1>
   <p>
    给定一位研究者论文被引用次数的数组（被引用次数是非负整数）。编写一个方法，计算出研究者的
    <em>
     h&nbsp;
    </em>
    指数。
   </p>
   <p>
    <a href="https://baike.baidu.com/item/h-index/3991452?fr=aladdin" target="_blank">
     h 指数的定义
    </a>
    : &ldquo;h 代表&ldquo;高引用次数&rdquo;（high citations），一名科研人员的 h 指数是指他（她）的 （N 篇论文中）
    <strong>
     至多
    </strong>
    有 h 篇论文分别被引用了
    <strong>
     至少
    </strong>
    h 次。（其余的&nbsp;
    <em>
     N - h&nbsp;
    </em>
    篇论文每篇被引用次数
    <strong>
     不多于
    </strong>
    <em>
     h
    </em>
    次。）&rdquo;
   </p>
   <p>
    &nbsp;
   </p>
   <p>
    <strong>
     示例:
    </strong>
   </p>
   <pre><strong>输入:</strong> <code>citations = [3,0,6,1,5]</code>
<strong>输出:</strong> 3 
<strong>解释: </strong>给定数组表示研究者总共有 <code>5</code> 篇论文，每篇论文相应的被引用了 <code>3, 0, 6, 1, 5</code> 次。
&nbsp;    由于研究者有 <code>3 </code>篇论文每篇<strong>至少</strong>被引用了 <code>3</code> 次，其余两篇论文每篇被引用<strong>不多于</strong> <code>3</code> 次，所以她的 <em>h </em>指数是 <code>3</code>。</pre>
   <p>
    &nbsp;
   </p>
   <p>
    <strong>
     说明:&nbsp;
    </strong>
    如果
    <em>
     h
    </em>
    有多种可能的值，
    <em>
     h
    </em>
    指数是其中最大的那个。
   </p>
  </div>
 </body>
</html>